Scheduling Task Parallel Applications For Rapid Turnaround on Desktop Grids
نویسندگان
چکیده
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xii
منابع مشابه
A group based fault tolerant scheduling mechanism to improve the application turnaround time on desktop grids
Desktop grid is an exciting discipline for high throughput applications but due to inherent resource volatility, desktop grids are not feasible for short lived applications that require rapid turnaround time. Efficient and more knowledgeable resource selection mechanism can make it possible. In this paper, we propose a group based resource scheduling mechanism. The groups are made by using thre...
متن کاملScheduling for Fast Turnaround Time on Institutional Desktop grid
Institutional desktop grids, that is, grids comprised by the desktop machines of an institution (academic or corporate) can act as an important source of computing power for local user, if the high volatility of such resources is properly harnessed. In this paper, we focus on scheduling techniques that can improve turnaround time of bagof-tasks applications. For that purpose, we combine shared-...
متن کاملA Log Analysis System with REST Web Services for Desktop Grids and its Application to Resource Group-based Task Scheduling
It is important that desktop grids should be able to aggressively deal with the dynamic properties that arise from the volatility and heterogeneity of resources. Therefore, it is required that task scheduling be able to positively consider the execution behavior that is characterized by an individual resource. In this paper, we implement a log analysis system with REST web services, which can a...
متن کاملSLA Constrained Adaptive Scheduling of Parallel Jobs in a Computational Desktop Grid
Desktop grids are usually equipped with hundreds or thousands of desktops which use the idle cycles of desktop PCs of small enterprises and institutions. From conventional multi -site cluster grids, desktop grids vary markedly in terms of their dynamic nature. In terms of their dynamic nature such grids vary markedly from conventional grids] . This causes the need of new scheduling algorithms ,...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005